Data Structure and Algorithm in Data Mining: Granular Computing View
نویسنده
چکیده
This paper discusses foundations of conventional style of rule mining in which rules are extracted from a data table. Rule mining mainly uses the structure of a table, data partition, but two different approaches are observed: divide and conquer and covering: the former focuses on the nature of data partition and the latter does on the nature of information granules. This paper illustrates that granular computing gives a unified view of these two approaches, which may lead to theoretical foundations of data mining in the near future.
منابع مشابه
A Granular Computing Approach to Machine Learning
The key to granular computing is to make use of granules in problem solving. Classification is one of the well studied problems in machine learning and data mining as it involves of discovery knowledge from large databases. We presents a granular computing view to classification problems and propose a granular computing approach to classification in this paper. The ID3 [8] and PRISM [2] algorit...
متن کاملEfficient Data Mining with Evolutionary Algorithms for Cloud Computing Application
With the rapid development of the internet, the amount of information and data which are produced, are extremely massive. Hence, client will be confused with huge amount of data, and it is difficult to understand which ones are useful. Data mining can overcome this problem. While data mining is using on cloud computing, it is reducing time of processing, energy usage and costs. As the speed of ...
متن کاملDeductive Data Mining using Granular Computing
What is Deductive Data Mining (DDM)? It is a methodology that derives patterns from the mathematical structure of the stored data. Among three core techniques of data mining [1], classifications and association rule mining are deductive data mining, while clustering is not, because its algorithms often use some properties of the ambient space. What is Granular Computing (GrC)? In general, it is...
متن کاملMining association rules with multiple minimum supports using maximum constraints
Data mining is the process of extracting desirable knowledge or interesting patterns from existing databases for specific purposes. Most of the previous approaches set a single minimum support threshold for all the items or itemsets. But in real applications, different items may have different criteria to judge its importance. The support requirements should then vary with different items. In t...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006